On Closed Sets of Ordinals

Intuitionistic Sets and Ordinals

Transitive extensional well founded relations provide an intuitionistic notion of ordinals which admits transfinite induction. However these ordinals are not directed and their successor operation is poorly behaved, leading to problems of functoriality. We show how to make the successor monotone by introducing plumpness, which strengthens transitivity. This clarifes the traditional development ...

Star-Free Sets of Words on Ordinals

The Theory of Sets of Ordinals

We propose a natural theory SO axiomatizing the class of sets of ordinals in a model of ZFC set theory. Both theories possess equal logical strength. Constructibility theory in SO corresponds to a natural recursion theory on ordinals.

Partitioning Pairs of Countable Sets of Ordinals

Lemma 1. There are ω1 disjoint stationary subsets of ω1. Proof. Let Cub(ω1) = {X ⊆ ω1 : ∃C ⊆ X(C is club on ω1)}. Then Cub(ω1) is countably complete filter. Its dual ideal Cub (ω1) = {X ⊆ ω1 : ∃X ′ ∈ Cub(ω1)(X = ω1\X ′)} is countably complete and contains all singletons and so all countable subsets of ω1. Recall also that X ⊆ ω1 is stationary if and only if X / ∈ Cub(ω1). For every ρ < ω1 let f...

Some Generalizations of Locally Closed Sets

Arenas et al. [1] introduced the notion of lambda-closed sets as a generalization of locally closed sets. In this paper, we introduce the notions of lambda-locally closed sets, Lambda_lambda-closed sets and lambda_g-closed sets and obtain some decompositions of closed sets and continuity in topological spaces.